Patterns in matchings and rook placements

نویسندگان

  • Jonathan Bloom
  • Sergi Elizalde
چکیده

Extending the notion of pattern avoidance in permutations, we study matchings and set partitions whose arc diagram representation avoids a given configuration of three arcs. These configurations, which generalize 3-crossings and 3-nestings, have an interpretation, in the case of matchings, in terms of patterns in full rook placements on Ferrers boards. We enumerate 312-avoiding matchings and partitions, obtaining algebraic generating functions, unlike in the 321-avoiding (i.e., 3-noncrossing) case. Our approach also provides a more direct proof of a formula of Bóna for the number of 1342-avoiding permutations. Additionally, we give a bijection proving the shape-Wilf-equivalence of the patterns 321 and 213 which simplifies existing proofs by Backelin–West–Xin and Jelı́nek. Résumé. Étendant la notion de motifs exclus dans des permutations, nous étudions des appariements et partitions dont le diagramme d’arc évite une configuration donnée de trois arcs. Ces configurations, qui généralisent les 3croissements et les 3-emboı̂tements, ont une interprétation, dans le cas d’appariements, en termes de motifs dans des placements pleins de tours sur des tables de Ferrers. Nous énumérons les appariements et les partitions qui évitent 312, obtenant des séries génératrices algébriques, contrairement au cas du motif 321. Notre approche fournit aussi une démonstration plus directe d’une formule de Bóna pour le nombre de permutations qui évitent 1342. En plus, nous donnons une preuve bijective de l’équivalence au sens de la forme et de Wilf des motifs 321 et 213 qui simplifie les preuves de Backelin–West–Xin et Jelı́nek.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Pattern Avoiding Permutations & Rook Placements

First, we look at the distribution of permutation statistics in the context of pattern-avoiding permutations. The first part of this chapter deals with a recursively defined bijection of Robertson [6] between 123and 132-avoiding permutations. We introduce the general notion of permutation templates and pivots in order to give a non-recursive pictorial reformulation of Robertson’s bijection. Thi...

متن کامل

Pattern Avoidance in Matchings and Partitions

Extending the notion of pattern avoidance in permutations, we study matchings and set partitions whose arc diagram representation avoids a given configuration of three arcs. These configurations, which generalize 3-crossings and 3-nestings, have an interpretation, in the case of matchings, in terms of patterns in full rook placements on Ferrers boards. We enumerate 312-avoiding matchings and pa...

متن کامل

Pattern Avoidance in the Rook Monoid

We consider two types of pattern avoidance in the rook monoid, i.e. the set of 0–1 square matrices with at most one nonzero entry in each row and each column. For one-dimensional rook patterns, we completely characterize monoid elements avoiding a single pattern of length at most three and develop an enumeration scheme algorithm to study rook placements avoiding sets of patterns.

متن کامل

q-Rook placements and Jordan forms of upper-triangular nilpotent matrices

The set of n by n upper-triangular nilpotent matrices with entries in a finite field Fq has Jordan canonical forms indexed by partitions λ ` n. We study a connection between these matrices and non-attacking q-rook placements, which leads to a combinatorial formula for the number Fλ(q) of matrices of fixed Jordan type as a weighted sum over rook placements. Résumé. L’ensemble des matrices triang...

متن کامل

Bijections on m-level rook placements

Suppose the rows of a board are partitioned into sets of m rows called levels. An m-level rook placement is a subset of the board where no two squares are in the same column or the same level. We construct explicit bijections to prove three theorems about such placements. We start with two bijections between Ferrers boards having the same number of m-level rook placements. The first generalizes...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2013